Non-discounted Denumerable Markovian Decision Models
نویسندگان
چکیده
منابع مشابه
Denumerable Constrained Markov Decision Problems and Finite Approximations Denumerable Constrained Markov Decision Problems and Finite Approximations
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Processes with a countable state and action spaces with general multi-chain structure. Second, to introduce nite approximation methods. We deene the occupation measures and obtain properties of the set of all achievable occupation measures under the diierent admissible policies. We est...
متن کاملOn the Discounted Penalty Function in a Markov-dependent Risk Model
We present a unified approach to the analysis of several popular models in collective risk theory. Based on the analysis of the discounted penalty function in a semi-Markovian risk model by means of Laplace-Stieltjes transforms, we rederive and extend some recent results in the field. In particular, the classical compound Poisson model, Sparre Andersen models with phase-type interclaim times an...
متن کاملMarkovian assignment decision process
— A finite-state, discrete-time Markovian décision process, in which, each action in each state is a feasible solution to a state dependent assignment problème is considered, The objective is to maximize the additive rewards realized by the assignments over an infinité time horizon. In the undiscounted case, the average gain per transition and in the discounted case, the discounted total gain r...
متن کاملLearning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning RL algorithms pro vide a sound theoretical basis for building learning control architectures for embedded agents Unfortunately all of the theory and much of the practice see Barto et al for an exception of RL is limited to Marko vian decision processes MDPs Many real world decision tasks however are inherently non Markovian i e the state of the environ ment is only incomp...
متن کاملDiscounted Continuous Time Markov Decision Processes: the Convex Analytic Approach
The convex analytic approach which is dual, in some sense, to dynamic programming, is useful for the investigation of multicriteria control problems. It is well known for discrete time models, and the current paper presents similar results for the continuous time case. Namely, we define and study the space of occupation measures, and apply the abstract convex analysis to the study of constraine...
متن کامل